#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, k;
    cin >> n >> k;
    V<int> son(n + 1, 0), w(n + 1, 0);

    V<V<int>> f(n + 1, V<int>(38, 0));

    V s(n + 1, V<int>(40, 0)), mn(n + 1, V<int>(40, 0));
    FOR(i, 1, n) cin >> son[i], son[i]++, f[i][0] = son[i];
    FOR(i, 1, n) cin >> w[i], mn[i][0] = s[i][0] = w[i];

    FOR(i, 1, 35) {
        FOR(j, 1, n) {
            f[j][i] = f[f[j][i - 1]][i - 1];
            s[j][i] = s[j][i - 1] + s[f[j][i - 1]][i - 1];
            mn[j][i] = min(mn[j][i - 1], mn[f[j][i - 1]][i - 1]);
        }
    }

    auto find = [&](int x) {
        int ans1 = 0, ans2 = 1e18;
        int p = k;
        FORD(i, 0, 35) {
            if ((1ll << i) > p) continue;
            ans1 += s[x][i], ans2 = min(ans2, mn[x][i]);
            x = f[x][i];
            p -= (1ll << i);
        }
        return PII{ans1, ans2};
    };

    FOR(i, 1, n) {
        auto [x, y] = find(i);
        cout << x << ' ' << y << endl;
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}